منابع مشابه
Feynman Diagrams via Graphical Calculus
It has been known for a while, in Hopf algebraists’ folklore, that there is a very close connection between the graphical formalism for ribbon categories and Feynman diagrams. Although this correspondence is frequently implied, it seems to have been first explicitly described in the recent [1]. Yet, we know of no systematic exposition in existing literature; the aim of this paper is to provide ...
متن کاملTriangle counting in streamed graphs via small vertex covers
We present a new randomized algorithm for estimating the number of triangles in massive graphs revealed as a stream of edges in arbitrary order. It exploits the fact that graphs arising from various domains often have small vertex covers, which enables us to reduce the space usage and sample complexity of triangle counting algorithms. The algorithm runs in four passes over the edge set and uses...
متن کاملCounting statistics: a Feynman-Kac perspective.
By building upon a Feynman-Kac formalism, we assess the distribution of the number of collisions in a given region for a broad class of discrete-time random walks in absorbing and nonabsorbing media. We derive the evolution equation for the generating function of the number of collisions, and we complete our analysis by examining the moments of the distribution and their relation to the walker ...
متن کاملFeynman Diagrams and the Quantum Stochastic Calculus
We present quantum stochastic calculus in terms of diagrams taking weights in the algebra of observables of some quantum system. In particular, we note the absence of non-time-consecutive Goldstone diagrams. We review recent results in Markovian limits in these terms. AMS Classification: 81S25, 81T18
متن کاملCounting Set Covers and Split Graphs
A bijection between split graphs and minimal covers of a set by subsets is presented. As the enumeration problem for such minimal covers has been solved, this implies that split graphs can also be enumerated. 1 Motivation A split graph is a chordal graph with a chordal complement. It is straightforward to recognize split graphs, and therefore to compute the numbers of split graphs on a small nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2013
ISSN: 1072-3374,1573-8795
DOI: 10.1007/s10958-013-1259-z